Runtime Verification Through Forward Chaining

Runtime Verification Through Forward Chaining

In this paper we present a novel rule-based approach for Runtime Verification of FLTL properties over finite but expanding traces. Our system exploits Horn clauses in implication form and relies on a forward chaining-based monitoring algorithm. This approach avoids the branching structure and exponential complexity typical of tableaux-based formulations, creating monitors with a single state an...

Making Forward Chaining Relevant

Planning by forward chaining through the world space has long been dismissed as being “obviously” infeasible. Nevertheless, this approach to planning has many advantages. Most importantly forward chaining planners maintain complete descriptions of the intermediate states that arise during the course of the plan’s execution. These states can be utilized to provide highly effective search control...

Forward-Chaining Partial-Order Planning

Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approaches of UCPOP and VHPOP. In this paper we explore the potential of a forward-chaining state-based search strategy to support partial-order planning in the solution of temporal-numeric problems. Our planner, POPF, is buil...

Runtime verification of programs using rule-based active system

Teaching Forward-Chaining Planning with JAVAFF

In this paper we present the results of our work looking at how to provide a hands-on learning experience in AI planning to an undergraduate audience, complementing a conventional lecture series. At the core of our approach is a new Java implementation of the well-known planner FF, JAVAFF. By using object-oriented programming techniques, JAVAFF serves as a flexible and comprehensible substrate ...